Split group codes
نویسندگان
چکیده
We construct a class of codes of length such that the minimum distance outside of a certain subcode is, up to a constant factor, bounded below by the square root of , a well-known property of quadratic residue codes. The construction, using the group algebra of an Abelian group and a special partition or splitting of the group, yields quadratic residue codes, duadic codes, and their generalizations as special cases. We show that most of the special properties of these codes have analogues for split group codes, and present examples of new classes of codes obtained by this construction.
منابع مشابه
A Digital Signature Scheme Based on Random Split of St-Gen Codes
Recently we proposed a method for a random split of Staircase-Generator codes (StGen codes) to counter the weaknesses found in the previous constructions of public key schemes using St-Gen codes. The initial proposal for the random split addressed only the encryption scheme, and we left the problem of how to apply the random splitting on the signature scheme open. In this work we solve that ope...
متن کاملOn the geometry of the exceptional group G 2( q ), q even
We study some geometry of the exceptional group G2(q), q even, in terms of symplectic geometric configurations in the projective space PG(5, q). Using the spin representation of Sp6(q), we obtain an alternative description of the Split Cayley hexagon H(q) related to G2(q). We also give another geometric proof of the maximality of G2(q), q even, in PSp6(q).
متن کاملSome two-character sets
Some new examples of two–character sets with respect to planes of PG(3,q2), q odd, are constructed. They arise from three–dimensional hyperbolic quadrics, from the geometry of an orthogonal polarity commuting with a unitary polarity. The last examples arise from the geometry of the unitary group PSU(3,3) acting on the split Cayley hexagon H(2). Dedicated to the memory of András Gács (1969-2009)
متن کاملLocality bounds on hamiltonians for stabilizer codes
In this paper, we study the complexity of Hamiltonians whose groundstate is a stabilizer code. We introduce various notions of k-locality of a stabilizer code, inherited from the associated stabilizer group. A choice of generators leads to a Hamiltonian with the code in its groundspace. We establish bounds on the locality of any other Hamiltonian whose groundspace contains such a code, whether ...
متن کاملSemantic Security and Key-Privacy with Random Split of St-Gen Codes
Recently we have defined Staircase-Generator codes (St-Gen codes) and their variant with a random split of the generator matrix of the codes. One unique property of these codes is that they work with arbitrary error sets. In this paper we give a brief overview of St-Gen codes and the list decoding algorithm for their decoding. We also analyze the semantic security against chosen plaintext attac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 46 شماره
صفحات -
تاریخ انتشار 2000